Shorter addition chain for smooth integers using decomposition method
نویسندگان
چکیده
منابع مشابه
analysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولAddition-Subtraction Chain for 160 bit Integers by using 2's Complement
Speeding up the scalar multiplication k.P is the major point in elliptic curve cryptosystem efficiency. The Addition-Subtraction (AS) Chain is efficient tool to do that where integer k is fixed and Point P is variable. Since the optimization problem to find the shortest AS Chain is NP-hard, many algorithms to get sub-optimal AS Chain in polynomial time are proposed. The window method is a class...
متن کاملSPA Resistant Scalar Multiplication using Golden Ratio Addition Chain Method
In this paper we propose an efficient and secure (SPA resistant) elliptic curve scalar multiplication algorithm over odd prime fields. For this purpose, we propose an explicit algorithm for short addition-subtraction chain method which utilizes a golden ratio. We term it as golden ratio addition chain method or GRAC method in short. Our proposed scalar multiplication algorithm based over GRAC m...
متن کاملGeneration of Addition Chain using Deterministic Division Based Method
Efficiency of a cryptosystem depends not only on the security it provides, but also it increases the operational speed thereby it reduces the time taken for encryption and decryption. In most numbertheoretic cryptographic algorithms like RSA, ElGamal, Massey-Omura etc., the encryption and decryption functions often involve raising large elements (x mod n) of group fields GF(2) or large powers (...
متن کاملFinding Shorter Addition/Subtraction-Chains
Small Finding a shorter addition/subtraction-chain for an integer is an important problem for many cryptographic systems based on number theory. Especially, execution time of multiplication on an elliptic curve cryptosystem is directly proportional to the length of the addition/subtraction-chain. In this paper, we propose an algorithm to find an addition/subtractionchain. The proposed algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Mathematics
سال: 2011
ISSN: 0020-7160,1029-0265
DOI: 10.1080/00207160.2010.543456